On codewords in the dual code of classical generalised quadrangles and classical polar spaces

نویسندگان

  • Valentina Pepe
  • Leo Storme
  • Geertrui Van de Voorde
چکیده

In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the code of points and generators ofQ(5, q) andH(5, q), and we present lower bounds on the weight of the codewords in the dual of the code of points and k-spaces of the classical polar spaces. Furthermore, we investigate the codewords with the largest weights in these codes, where for q even and k sufficiently small, we determine the maximum weight and characterise the codewords of maximum weight. Moreover, we show that there exists an interval such that for every even number w in this interval, there is a codeword in the dual code of Q(5, q), q even, with weight w and we show that there is an empty interval in the weight distribution of the dual of the code of Q(4, q), q even. To prove this, we show that a blocking set of Q(4, q), q even, of size q +1+ r, where 0 < r < (q+4)/6, contains an ovoid of Q(4, q), improving on [5, Theorem 9].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On codewords in the dual code of classical generalized quadrangles and classical polar spaces

In [8], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterized. Using geometrical arguments, we characterize the codewords of small weight in the dual code of the code of points and generators of Q(5, q) and H(5, q). For the dual codes of the codes of Q(5, q), q even, and Q(4, q), q even, we investigate the codewords with the largest weights....

متن کامل

How to draw a hexagon

Pictures of the G2(2) hexagon and its dual are presented. A way to obtain these pictures is discussed. 1. Introduction This paper presents pictures of the two classical generalised hexagons over the eld with two elements. Information on these generalised hexagons is employed so that the pictures make some properties of these hexagons obvious. Familiarity with the theory of generalised polygons ...

متن کامل

Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles

We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We analyze the geometry of the non-singular parabolic quadric in PG(4, q) to find information about the low-density parity check codes defined by Q(4, q), W(q) and H(3, q). ForW(q) and H(3, q), we are able to describe smal...

متن کامل

Antidesigns and regularity of partial spreads in dual polar graphs

We give several examples of designs and antidesigns in classical finite polar spaces. These types of subsets of maximal totally isotropic subspaces generalize the dualization of the concepts of m-ovoids and tight sets of points in generalized quadrangles. We also consider regularity of partial spreads and spreads. The techniques that we apply were developed by Delsarte. In some polar spaces of ...

متن کامل

Tight sets, weighted m -covers, weighted m -ovoids, and minihypers

Minihypers are substructures of projective spaces introduced to study linear codes meeting the Griesmer bound. Recently, many results in finite geometry were obtained by applying characterization results on minihypers [8, 17, 18]. In this paper, using characterization results on certain minihypers, we present new results on tight sets in classical finite polar spaces and weighted m-covers, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 310  شماره 

صفحات  -

تاریخ انتشار 2010